Siegel's lemma with additional conditions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Siegel’s Lemma with Additional Conditions

The name Siegel’s Lemma is usually used to denote results about non-trivial small-height solutions of a system of homogeneous linear equations, or (which is the same) about non-zero points of small height in a given vector space. Such a result in a simple form was first proved by Thue in 1909 using the Dirichlet’s box principle. Siegel in 1929 was the first to formally state this principle in t...

متن کامل

Theories of Bundles with Additional Homotopy Conditions

In the present paper we study bundles equipped with extra homotopy conditions, in particular so-called n-bundles. It is shown that (under some condition) the classifying space of 1-bundles is the double coset space of some finite dimensional Lie group. We also establish some relation between our bundles and C*-algebras.

متن کامل

Probing Graph Proper Total Colorings With Additional Constrained Conditions

Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper total colorings with additional constrained conditions have been investigated intensively in the last decade year. In this article some new graph proper total...

متن کامل

On the Gaussian Random Matrix Ensembles with Additional Symmetry Conditions

The Gaussian unitary random matrix ensembles satisfying some additional symmetry conditions are considered. The effect of these conditions on the limiting normalized counting measures and correlation functions is studied.

متن کامل

Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions

The main result of this paper is that for a special, but rather wide class of "sample graphs", the extremal graphs, i.e, the graphs of n vertices without subgraphs isomorphic to the sample graph and having maximum number of edges under this condition, have very simple and sYmmetric structure. This result remains valid even in the case when the' condition "the graph does not contain the sample g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2006

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2005.11.009